A semi-finite algebra associated to a subfactor planar algebra
نویسندگان
چکیده
منابع مشابه
An orthogonal approach to the subfactor of a planar algebra
Starting from a subfactor planar algebra, a construction was given in [GJS07] of a tower of II1 factors whose standard invariant is precisely the given planar algebra. The construction was entirely in terms of planar diagrams and gave a diagrammatic reproof of a result of Popa in [Pop95]. The inspiration for the paper was from the theory of large random matrices where expected values of words o...
متن کاملA Planar Algebra Construction of the Haagerup Subfactor
Most known examples of subfactors occur in families, coming from algebraic objects such as groups, quantum groups and rational conformal field theories. The Haagerup subfactor is the smallest index finite-depth subfactor which does not occur in one of these families. In this paper we construct the planar algebra associated to the Haagerup subfactor, which provides a new proof of the existence o...
متن کاملAn Elementary Proof of a Non-triviality of the E8 Subfactor Planar Algebra
In this paper, we show in a combinatorial way that the E8 subfactor planar algebra is 1-dimensional. In the proof, we improve the Bigelow’s relation of the E8 subfactor planar algebra and give an efficient algorithm to reduce any planar diagram to the empty diagram.
متن کاملAn Obstruction to Subfactor Principal Graphs from the Graph Planar Algebra Embedding Theorem
We find a new obstruction to the principal graphs of subfactors. It shows that in a certain family of 3-supertransitive principal graphs, there must be a cycle by depth 6, with one exception, the principal graph of the Haagerup subfactor. This is the published version of arXiv:1302.5148. A II1 subfactor is an inclusion A ⊂ B of infinite von Neumann algebras with trivial centre and a compatible ...
متن کاملThe Broken Ptolemy Algebra: a Finite-type Laurent Phenomenon Algebra
Type A, or Ptolemy cluster algebras are a prototypical example of finite type cluster algebras, as introduced by Fomin and Zelevinsky. Their combinatorics is that of triangulations of a polygon. Lam and Pylyavskyy have introduced a generalization of cluster algebras where the exchange polynomials are not necessarily binomial, called Laurent phenomenon algebras. It is an interesting and hard que...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Analysis
سال: 2011
ISSN: 0022-1236
DOI: 10.1016/j.jfa.2011.05.004